Generalized State Realizations of Reed-Muller Codes

نویسنده

  • G. David Forney
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Another Generalization of the Reed-Muller Codes

The punctured binary Reed-Muller code is cyclic and was generalized into the punctured generalized ReedMuller code over GF(q) in the literature. The major objective of this paper is to present another generalization of the punctured binary Reed-Muller code. Another objective is to construct a family of reversible cyclic codes that are related to the newly generalized Reed-Muller codes. Index Te...

متن کامل

On the third weight of generalized Reed-Muller codes

In this paper, we study the third weight of generalized Reed-Muller codes. Using results from [6], we prove under some restrictive condition that the third weight of generalized Reed-Muller codes depends on the third weight of generalized Reed-Muller codes of small order with two variables. In some cases, we are able to determine the third weight and the third weight codewords of generalized Re...

متن کامل

The Treewidth of MDS and Reed-Muller Codes

The constraint complexity of a graphical realization of a linear code is the maximum dimension of the local constraint codes in the realization. The treewidth of a linear code is the least constraint complexity of any of its cycle-free graphical realizations. This notion provides a useful parametrization of the maximum-likelihood decoding complexity for linear codes. In this paper, we prove the...

متن کامل

Highly Testable Finite State Machines Based on EXOR Logic

It is well-known that AND/EXOR circuits are more easily testable than AND/OR circuits. Therefore, in this paper, we primarily propose to use AND/EXOR realizations for implementation of the combinational logic parts of finite state machines. Then, we investigate the effect of different state assignments (i.e. one-hot, gray-code, etc.) and that of using different types of registers (i.e. D-type, ...

متن کامل

Generalized Reed-Muller codes over Galois rings

Recently, Bhaintwal and Wasan studied the Generalized Reed-Muller codes over the prime power integer residue ring. In this paper, we give a generalization of these codes to Generalized Reed-Muller codes over Galois rings.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999